On the Iteration of Weak Wreath Products
نویسنده
چکیده
Based on a study of the 2-category of weak distributive laws, we describe a method of iterating Street’s weak wreath product construction. That is, for any 2-category K and for any non-negative integer n, we introduce 2-categories Wdl(K), of (n + 1)-tuples of monads in K pairwise related by weak distributive laws obeying the Yang-Baxter equation. The first instance Wdl(K) coincides with Mnd(K), the usual 2-category of monads in K, and for other values of n, Wdl(K) contains Mnd(K) as a full 2-subcategory. For the local idempotent closure K of K, extending the multiplication of the 2-monad Mnd, we equip these 2-categories with n possible ‘weak wreath product’ 2-functors Wdl(K) → Wdl(n−1)(K), such that all of their possible n-fold composites Wdl(K) → Wdl(K) are equal; that is, such that the weak wreath product is ‘associative’. Whenever idempotent 2cells in K split, this leads to pseudofunctors Wdl(K) → Wdl(n−1)(K) obeying the associativity property up-to isomorphism. We present a practically important occurrence of an iterated weak wreath product: the algebra of observable quantities in an Ising type quantum spin chain where the spins take their values in a dual pair of finite weak Hopf algebras. We also construct a fully faithful embedding of Wdl(K) into the 2-category of commutative n + 1 dimensional cubes in Mnd(K) (hence into the 2-category of commutative n + 1 dimensional cubes in K whenever K has Eilenberg-Moore objects and its idempotent 2-cells split). Finally we give a sufficient and necessary condition on a monad in K to be isomorphic to an n-ary weak wreath product.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملFlag Weak Order on Wreath Products
A generating set for the wreath product Zr ≀ Sn which leads to a nicely behaved weak order is presented. It is shown that the resulting poset has properties analogous to those of the weak order on the symmetric group: it is a self-dual lattice, ranked by the Foata–Han flag inversion number; any two maximal chains are connected via Tits-type pseudo-Coxeter moves; and its intervals have the desir...
متن کاملNew three-step iteration process and fixed point approximation in Banach spaces
In this paper we propose a new iteration process, called the $K^{ast }$ iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing well-known iteration processes using numerical examples. Stability of the $K^{ast}$ iteration process is also discussed. Finally we prove some weak and strong convergence theorems for Suzuki ge...
متن کاملA SOLOMON DESCENT THEORY FOR THE WREATH PRODUCTS G Sn
We propose an analogue of Solomon’s descent theory for the case of a wreath product G Sn, where G is a finite abelian group. Our construction mixes a number of ingredients: Mantaci-Reutenauer algebras, Specht’s theory for the representations of wreath products, Okada’s extension to wreath products of the Robinson-Schensted correspondence, and Poirier’s quasisymmetric functions. We insist on the...
متن کاملOn Property (fa) for Wreath Products
We characterize permutational wreath products with Property (FA). For instance, the standard wreath product A o B of two nontrivial countable groups A,B has Property (FA) if and only if B has Property (FA) and A is a finitely generated group with finite abelianisation. We also prove an analogous result for hereditary Property (FA). On the other hand, we prove that many wreath products with here...
متن کامل